Constraint - Based Timetabling for Universities
نویسنده
چکیده
A timetable is a temporal arrangement of a set of meetings such that all given constraints are satis-ed. A timetabling problem can be suitably modelled in terms of a set of constraints. We use constraint logic programming and develop methods, techniques and concepts for a combined interactive and automatic timetabling of university courses and school curricula. An exemplary application of such a timetabling system was developed for the Charit e The timetabling systems is exible enough to take into account special user requirements and to allow constraints to be modiied easily, if no basic conceptual change in the timetabling is necessary. An essential component is an automatic heuristic solution search with an interactive user-intervention facility. The user will, however, only be able to alter a timetable or schedule in such as way that no hard constraints are violated.
منابع مشابه
Memetic Algorithms for Timetabling
Course timetabling problems are real world constraint optimization problems that are often coped with in educational institutions, such as universities or high schools. In this paper, we present a variety of new operators that can be also applied in evolutionary algorithms for other timetabling problems, such as, exam timetabling. Operators include violation directed mutations, crossovers, and ...
متن کاملÁaeëìáìíì Íê Áaeaeçêååìáã
Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and ...
متن کاملUniversity Course Timetabling Using Constraint Handling Rules
Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and ...
متن کاملUsing fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملThe Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...
متن کامل